An Extension Of The Ruzsa-Szemerédi Theorem

We let G(n,m) denote the set of r-uniform hypergraphs with n vertices and m edges, and f (n,p,s) is the smallest m such that every member of G(n,m) contains a member of G(p,s). In this paper we are interested in fixed values r,p and s for which f (n,p,s) grows quadratically with n. A probabilistic construction of Brown, Erdős and T. Sós ([2]) implies that f (n,s(r−2)+2, s)=Ω(n). In the other direction the most interesting question they could not settle was whether f (n,6,3) = o(n). This was proved by Ruzsa and Szemerédi [11]. Then Erdős, Frankl and Rödl [6] extended this result to any r: f (n,3(r−2)+3,3) = o(n), and they conjectured ([4], [6]) that the Brown, Erdős and T. Sós bound is best possible in the sense that f (n,s(r−2)+3, s)=o(n). In this paper by giving an extension of the Erdős, Frankl, Rödl Theorem (and thus the Ruzsa–Szemerédi Theorem) we show that indeed the Brown, Erdős, T. Sós Theorem is not far from being best possible. Our main result is